An Erd os-Gallai Theorem For Matroids

نویسنده

  • Sean McGuinness
چکیده

Erd os and Gallai showed that for any simple graph with n vertices and circumference c it holds that |E(G)| ≤ 2 (n−1)c.We extend this theorem to simple binary matroids having no F7-minor by showing that for such a matroid M with circumference c(M)≥ 3 it holds that |E(M)| ≤ 1 2 r(M)c(M). Mathematics Subject Classi cation (2000). Primary 05D15; Secondary 05B35.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraph Extensions of the Erdos-Gallai Theorem

Our goal is to extend the following result of Erd˝ os and Gallai for hypergraphs: Theorem 1 (Erd˝ os-Gallai [1]) Let G be a graph on n vertices containing no path of length k. Then e(G) ≤ 1 2 (k − 1)n. Equality holds iff G is the disjoint union of complete graphs on k vertices. We consider several generalizations of this theorem for hypergraphs. This is due to the fact that there are several po...

متن کامل

The Erd} Os-nagy Theorem and Its Ramiications

os-Nagy Theorem and its Rami cations Godfried Toussaint School of Computer Science McGill University Montr eal, Qu ebec, Canada June 29, 1999 Abstract Given a simple polygon in the plane, a ip is dened as follows: consider the convex hull of the polygon. If there are no pockets do not perform a ip. If there are pockets then re ect one pocket across its line of support of the polygon to obtain a...

متن کامل

Rational Erd} Os Numbers

The concept of Erd} os number is well known among mathematicians and somewhat known more generally (see, for example, de Castro & Grossman, 1999] or the web site Paul Erd} os, who died in late 1996, was a mathematician who was author or coauthor|most often the latter|of nearly 1500 papers and had nearly 500 coauthors. By deenition, Erd} os had Erd} os number zero, his collaborators had Erd} os ...

متن کامل

On the Erdős - Fuchs Theorem 3

We prove several extensions of the Erd˝ os-Fuchs theorem.

متن کامل

Generalized and geometric Ramsey numbers for cycles

Let C n denote the cycle of length n. The generalized Ramsey number of the pair (C n ; C k), denoted by R(C n ; C k), is the smallest positive integer R such that any complete graph with R vertices whose edges are coloured with two diierent colours contains either a monochromatic cycle of length n in the rst colour or a monochromatic cycle of length k in the second colour. Generalized Ramsey nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009